Rewriting as a Unified Specification Tool for Logic and Control: The ELAN Language

نویسندگان

  • P. Borovansky
  • Peter Borovanský
  • Claude Kirchner
  • Hélène Kirchner
چکیده

We introduce computational systems to formalise the notion of rewriting directed by user defined strategies. This provides a semantics for ELAN, an environment dedicated to prototype, experiment and study the combination of different deduction systems for constraint solving, theorem proving and logic programming paradigms. Formally, a computational system can be represented as a rewrite theory in rewriting logic together with a notion of strategy to select relevant computations. We show how conveniently the strategies can also be specified using again computational systems. Several non-trivial examples of strategy description are described including a search space library and its use for solving problems like game winning strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

REM (Reduce Elan Machine): Core of the New ELAN Compiler

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. It offers a natural and simple logical framework for the combination of the computation and deduction paradigms. It supports the design of theorem provers, logic programming languages, constraint solvers and decision procedures. ELAN takes f...

متن کامل

A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers

This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...

متن کامل

Architectural Specification, Exploration and Simulation Through Rewriting-Logic

In recent years Arvind’s Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specified by term rewriting systems are translated into a standard hardware description language for simulation purposes. In this work we present our current investigation on the use of Rewriting-Logic, which is a more powerful th...

متن کامل

Rewriting Logic as a Framework for Generic Verification Tools

In this paper we propose to employ Rewriting Logic as a generic and uniform approach to support different specification languages for distributed systems in verification tools. We present a compiler generator which, given the definition of a language, automatically generates a corresponding model–checking tool. More specifically, the syntax and semantics of the specification language has to be ...

متن کامل

CARIBOO : A Multi-Strategy Termination Proof Tool Based on Induction

CARIBOO is a termination proof tool for rule-based programming languages, where a program is a rewrite system and query evaluation consists in rewriting a ground expression [3]. It applies to languages such as ASF+SDF, Maude, Cafe-OBJ, or ELAN. By contrast with most of the existing tools, which prove in general termination of standard rewriting (rewriting without strategy) on the free term alge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997